منابع مشابه
Decidability Problems for Actor Systems
We introduce a nominal actor-based language and study its expressive power. We have identified the presence/absence of fields as a relevant feature: the dynamic creation of names in combination with fields gives rise to Turing completeness. On the other hand, restricting to stateless actors gives rise to systems for which properties such as termination are decidable. Such decidability result ho...
متن کاملDecidability problems in automaton semigroups
We consider decidability problems in self-similar semigroups, and in particular in semigroups of automatic transformations of X. We describe algorithms answering the word problem, and bound its complexity under some additional assumptions. We give a partial algorithm that decides in a group generated by an automaton, given x, y, whether an Engel identity (r ̈ ̈ ̈ rrx, ys, ys, . . . , ys “ 1 for ...
متن کاملDecidability Problems for Self-induced Systems Generated by a Substitution
In this talk we will survey several decidability and undecidability results on topological properties of self-affine or self-similar fractal tiles. Such tiles are obtained as fixed point of set equations governed by a graph. The study of their topological properties is known to be complex in general: we will illustrate this by undecidability results on tiles generated by multitape automata. In ...
متن کاملDecidability Problems in Languages with Henkin Quantifiers
Krynicki, M. and M. Mostowski, Decidability problems in languages with Henkin quantifiers, Annals of Pure and Applied Logic 58 (1992) 149-172. We consider the language L(H,) with all Henkin quantifiers H, defined as follows: H,,x,...x,y,.~.y, 4(x,,..., x,, Y,, . , Y,) iff 3f, . . .f, Vxx, . . .x, 9(x,, . . ,x,, f,(xA . , f,(x,)). We show that the theory of equality in L(H,) is undecidable. The ...
متن کاملSolving Decidability Problems with Interval Arithmetic
An affine iterated function system (IFS, [4]) over the reals is given by a set of contractive affine transformations on a complete metric space R for some positive natural number k. Thus an interesting problem is to decide, whether a given matrix M describes a contraction mapping, i.e. whether there exists some s < 1 such that |Mz| ≤ s|z| for each z ∈ R, where | · | denotes the Euclidean norm. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00165-5